50 research outputs found
Detection of selfish manipulation of carrier sensing in 802.11 networks
Recently, tuning the clear channel assessment (CCA) threshold in conjunction with power control has been considered for improving the performance of WLANs. However, we show that, CCA tuning can be exploited by selfish nodes to obtain an unfair share of the available bandwidth. Specifically, a selfish entity can manipulate the CCA threshold to ignore ongoing transmissions; this increases the probability of accessing the medium and provides the entity a higher, unfair share of the bandwidth. We experiment on our 802.11 testbed to characterize the effects of CCA tuning on both isolated links and in 802.11 WLAN configurations. We focus on AP-client(s) configurations, proposing a novel approach to detect this misbehavior. A misbehaving client is unlikely to recognize low power receptions as legitimate packets; by intelligently sending low power probe messages, an AP can efficiently detect a misbehaving node. Our key contributions are: 1) We are the first to quantify the impact of selfish CCA tuning via extensive experimentation on various 802.11 configurations. 2) We propose a lightweight scheme for detecting selfish nodes that inappropriately increase their CCAs. 3) We extensively evaluate our system on our testbed; its accuracy is 95 percent while the false positive rate is less than 5 percent. © 2012 IEEE
Facets for Art Gallery Problems
The Art Gallery Problem (AGP) asks for placing a minimum number of stationary
guards in a polygonal region P, such that all points in P are guarded. The
problem is known to be NP-hard, and its inherent continuous structure (with
both the set of points that need to be guarded and the set of points that can
be used for guarding being uncountably infinite) makes it difficult to apply a
straightforward formulation as an Integer Linear Program. We use an iterative
primal-dual relaxation approach for solving AGP instances to optimality. At
each stage, a pair of LP relaxations for a finite candidate subset of primal
covering and dual packing constraints and variables is considered; these
correspond to possible guard positions and points that are to be guarded.
Particularly useful are cutting planes for eliminating fractional solutions.
We identify two classes of facets, based on Edge Cover and Set Cover (SC)
inequalities. Solving the separation problem for the latter is NP-complete, but
exploiting the underlying geometric structure, we show that large subclasses of
fractional SC solutions cannot occur for the AGP. This allows us to separate
the relevant subset of facets in polynomial time. We also characterize all
facets for finite AGP relaxations with coefficients in {0, 1, 2}.
Finally, we demonstrate the practical usefulness of our approach. Our cutting
plane technique yields a significant improvement in terms of speed and solution
quality due to considerably reduced integrality gaps as compared to the
approach by Kr\"oller et al.Comment: 29 pages, 18 figures, 1 tabl
Online Dominating Set
This paper is devoted to the online dominating set problem and its variants on trees, bipartite, bounded-degree, planar, and general graphs, distinguishing between connected and not necessarily connected graphs. We believe this paper represents the first systematic study of the effect of two limitations of online algorithms: making irrevocable decisions while not knowing the future, and being incremental, i.e., having to maintain solutions to all prefixes of the input. This is quantified through competitive analyses of online algorithms against two optimal algorithms, both knowing the entire input, but only one having to be incremental. We also consider the competitive ratio of the weaker of the two optimal algorithms against the other. In most cases, we obtain tight bounds on the competitive ratios. Our results show that requiring the graphs to be presented in a connected fashion allows the online algorithms to obtain provably better solutions. Furthermore, we get detailed information regarding the significance of the necessary requirement that online algorithms be incremental. In some cases, having to be incremental fully accounts for the online algorithm\u27s disadvantage
Engineering Art Galleries
The Art Gallery Problem is one of the most well-known problems in
Computational Geometry, with a rich history in the study of algorithms,
complexity, and variants. Recently there has been a surge in experimental work
on the problem. In this survey, we describe this work, show the chronology of
developments, and compare current algorithms, including two unpublished
versions, in an exhaustive experiment. Furthermore, we show what core
algorithmic ingredients have led to recent successes
Análise física e morfológica do efeito de diferentes concentrações de adesivo no recobrimento de sementes de capim ramirez (Paspalum guenoarum).
O objetivo deste trabalho foi avaliar a eficiência do recobrimento nas sementes de Paspalum guenoarum, utilizando diferentes concentrações de adesivo, a fim de melhorar a qualidade das sementes e tornar mais viável sua utilização.CIC
Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains
We study the problem Minimum Hidden Guard Set, which consists of positioning a minimum number of guards in a given polygon or terrain such that no two guards see each other and such that every point in the polygon or on the terrain is visible from at least one guard. By constructing a gap-preserving reduction from Maximum 5-Ocurrence-3-Satisfiability, we show that this problem cannot be approximated by a polynomial-time algorithm with an approximation ratio of n 1−ɛ for any ɛ>0, unless NP = P, where n is the number of polygon or terrain vertices. The result even holds for input polygons without holes. This separates the problem from other visibility problems such as guarding and hiding, where strong inapproximability results only hold for polygons with holes. Furthermore, we show that an approximation algorithm achieves a matching approximation ratio of n